A secure approach to election scheme based on Naccache Stern Knapsack Cryptosystem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A secure approach to election scheme based on Naccache Stern Knapsack Cryptosystem

Election is a fundamental mechanism of democracy for people to elect a Government of their choice. Electronic voting is an emerging technology that guarantees privacy, security, correctness, verifiability and robustness. Recently, many researchers have proposed the improvements of efficient schemes on the electronic voting to ensure the security and privacy of voters. However, there is no schem...

متن کامل

Exploring Naccache-Stern Knapsack Encryption

The Naccache–Stern public-key cryptosystem (NS) relies on the conjectured hardness of the modular multiplicative knapsack problem: Given p, {vi}, ∏ vi i mod p, find the {mi}. Given this scheme’s algebraic structure it is interesting to systematically explore its variants and generalizations. In particular it might be useful to enhance NS with features such as semantic security, re-randomizabili...

متن کامل

Group Authentication Using The Naccache-Stern Public-Key Cryptosystem

A group authentication protocol authenticates pre-defined groups of individuals such that: • No individual is identified • No knowledge of which groups can be successfully authenticated is known to the verifier • No sensitive data is exposed The paper presents a group authentication protocol based on splitting the private keys of the Naccache-Stern public-key cryptosystem in such a way that the...

متن کامل

Linear Bandwidth Naccache-Stern Encryption

The Naccache-Stern (ns) knapsack cryptosystem is an original yet little-known public-key encryption scheme. In this scheme, the ciphertext is obtained by multiplying public-keys indexed by the message bits modulo a prime p. The cleartext is recovered by factoring the ciphertext raised to a secret power modulo p. ns encryption requires a multiplication per two plaintext bits on the average. Decr...

متن کامل

A secure cryptosystem based on affine transformation

In this paper, it is proved that Lin et al.'s scheme that tried to strengthen the Hill cipher against the known-plaintext attack has several security flaws and is vulnerable to the chosenciphertext attack. This paper also introduces a secure and efficient symmetric cryptosystem based on affine transformation. The proposed cryptosystem includes an encryption algorithm that is an improved variant...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2010

ISSN: 0975-8887

DOI: 10.5120/840-1125